منابع مشابه
Fast Broadcasting with Byzantine Faults
We construct and analyze a fast broadcasting algorithm working in the presence of Byzantine component faults. Such faults are particularly difficult to deal with, as faulty components may behave arbitrarily (even maliciously) as transmitters, by either blocking, rerouting, or altering transmitted messages in a way most detrimental to the broadcasting process. We assume that links and nodes of a...
متن کاملBroadcasting with linearly bounded transmission faults
We consider broadcasting with a linearly bounded number of transmission failures. For a constant parameter 0 < < 1 we assume that at most i faulty transmissions can occur during the rst i time units of the communication process, for every natural number i. Every informed node can transmit information to at most one neighbor in a unit of time. Faulty transmissions have no eeect. We investigate w...
متن کاملOptimal Broadcasting in Hypercubes with Dynamic Faults
We consider the broadcasting problem in the shouting communication mode in which any node of a network can inform all its neighbours in one time step. In addition, during any time step a number of links less than the edge-connectivity of the network can be faulty. The problem is to nd an upper bound on the number of time steps necessary to complete broadcasting under this additional assumption....
متن کاملEfficient broadcasting with linearly bounded faults I*,
We consider the problem of broadcasting in the presence of linearly bounded number of transient faults. For some fixed 0 <IX < 1 we assume that at most zi faulty transmissions can occur during the first i time units of the broadcasting algorithm execution, for every natural i. In a unit of time every node can communicate with at most one neighbor. We prove that some bounded degree networks are ...
متن کاملBroadcasting in Synchronous Networks with Dynamic Faults
The problem of broadcasting in a network is to disseminate information from one node to all other nodes by transmitting it over communication links that connect nodes. We consider the time of broadcasting in the presence of at most k dynamic link failures. If a node knows source information, then in the next step all its neighbors connected by operational links also get to know it. Faults are d...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1988
ISSN: 0166-218X
DOI: 10.1016/0166-218x(88)90037-6